Following a curve with the discrete Fréchet distance
نویسندگان
چکیده
منابع مشابه
Discretely Following a Curve
Finding the similarity between paths is an important problem that comes up in many areas such as 3D modeling, GIS applications, ordering, and reachability. Given a set of points S, a polygonal curve P , and an ε > 0, the discrete set-chain matching problem is to find another polygonal curve Q such that the nodes of Q are points in S and dF (P,Q) ≤ ε. Here, dF is the discrete Fréchet distance be...
متن کاملA Middle Curve Based on Discrete Fréchet Distance
Given a set of polygonal curves we seek to find a “middle curve” that represents the set of curves. We ask that the middle curve consists of points of the input curves and that it minimizes the discrete Fréchet distance to the input curves. We develop algorithms for three different variants of this problem.
متن کاملComputing the Fréchet Gap Distance
Measuring the similarity of two polygonal curves is a fundamental computational task. Among alternatives, the Fréchet distance is one of the most well studied similarity measures. Informally, the Fréchet distance is described as the minimum leash length required for a man on one of the curves to walk a dog on the other curve continuously from the starting to the ending points. In this paper we ...
متن کاملComputing the discrete Fréchet distance upper bound of imprecise input is NP-hard
The Fréchet distance is a natural measure of similarity between two curves [4]. The Fréchet distance between two curves is often referred to as the “dog-leash distance”. Alt and Godau [4] presented an algorithm to compute the Fréchet distance between two polygonal curves of n and m vertices in O(nm log(nm)) time. There has been a lot of applications using the Fréchet distance to do pattern/curv...
متن کاملOn the Complexity of Protein Local Structure Alignment Under the Discrete Fréchet Distance
Protein structure alignment is a fundamental problem in computational and structural biology. While there has been lots of experimental/heuristic methods and empirical results, very little is known regarding the algorithmic/complexity aspects of the problem, especially on protein local structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 556 شماره
صفحات -
تاریخ انتشار 2014